Dispatch of mobile sensors in the presence of Obstacles Using Modified Dijkstra Algorithm
نویسنده
چکیده
A hybrid wireless sensor network consists of both static sensor and mobile sensor nodes. Static sensors monitor the environment and report events occurring in the sensing field. Mobile sensors are then dispatched to visit these event locations to conduct more advanced analysis. The sensing field may contain obstacles. A big challenge is how to dispatch the mobile sensor to the event location without colliding with any obstacles and mobile sensor should reach the event location in a shortest path. Therefore the objective of the paper is to dispatch the mobile sensor to the event location in a shortest collisionfree path. This paper gives a modified dijkstra’s algorithm to dispatch mobile sensor from its position to the event location. Our solution proposes a simple way to dispatch the mobile sensor to the event location in the presence of obstacle with modified dijkstra’s algorithm. This paper contributes in defining a more general and easiest dispatch solution in the presence of obstacles.
منابع مشابه
Optimal Operation of Microgrid in the presence of Real-time Pricing Demand Response Program using Artificial Bee Colony Algorithm with a Modified Choice Function
Abstract: Microgrid is one of the newest technologies in power systems. Microgrid can usually has a set of distributed energy resources that makes it able to operate separate from power grid. Optimal operation of microgrids means the optimal dispatch of power resources through day and night hours. This thesis proposed a new method for optimal operation of microgrid. In this method, real-time pr...
متن کاملDynamic Obstacle Avoidance by Distributed Algorithm based on Reinforcement Learning (RESEARCH NOTE)
In this paper we focus on the application of reinforcement learning to obstacle avoidance in dynamic Environments in wireless sensor networks. A distributed algorithm based on reinforcement learning is developed for sensor networks to guide mobile robot through the dynamic obstacles. The sensor network models the danger of the area under coverage as obstacles, and has the property of adoption o...
متن کاملPresentation of algorithm for a full proximate flat surface optimum padding included obstacles with use routing algorithms
This article proposes a new planning navigation strategy for use with mobile terrestrial robots. The proposed algorithm is applicable in any point of the areas for tasks such as cleaning the floors of building, mowing and clearing mined areas. The strategy of this algorithm is analyzed and checked in conditions where the environment and the obstacles are known. There are various routing algorit...
متن کاملA Cellular Automaton Based Algorithm for Mobile Sensor Gathering
In this paper we proposed a Cellular Automaton based local algorithm to solve the autonomously sensor gathering problem in Mobile Wireless Sensor Networks (MWSN). In this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. The sensors decide to move only based on their local information. Cellular Automaton (CA) as dynamical sy...
متن کاملA New Method of Mobile Robot Navigation: Shortest Null Space
In this paper, a new method was proposed for the navigation of a mobile robot in an unknown dynamic environment. The robot could detect only a limited radius of its surrounding with its sensors and it went on the shortest null space (SNS) toward the goal. In the case of no obstacle, SNS was a direct path from the robot to goal; however, in the presence of obstacles, SNS was a space around the r...
متن کامل